Computing the average parallelism in trace monoids
نویسندگان
چکیده
منابع مشابه
Computing the average parallelism in trace monoids
The height of a trace is the height of the corresponding heap of pieces in Viennot’s representation, or equivalently the number of factors in its Cartier-Foata decomposition. Let h(t) and |t| stand respectively for the height and the length of a trace t. We prove that the bivariate commutative series ∑ t xy is rational, and we give a finite representation of it. We use the rationality to obtain...
متن کامل1 Computing the average parallelism in trace monoids ∗
The height of a trace is the height of the corresponding heap of pieces in Viennot’s representation, or equivalently the number of factors in its Cartier-Foata decomposition. Let h(t) and |t| stand respectively for the height and the length of a trace t. We prove that the bivariate commutative series ∑ t xy is rational, and we give a finite representation of it. We use the rationality to obtain...
متن کاملComputing the Average Height in Trace Monoids
The height of a trace is the height of the corresponding heap of pieces in Viennot's representation, or equivalently the number of factors in its Cartier-Foata decomposition. Let h(t) and jtj stand respectively for the height and the length of a trace t. We prove that the bivariate commutative series P t x h(t) y jtj is rational, and we give a nite representation of it. We use this result to ob...
متن کاملPattern Matching in Trace Monoids
An algorithm is presented solving the factor problem in trace monoids Given two traces represented by words the algorithm determines in linear time whether the rst trace is a factor of the second one The space used for this task is linear in the length of the rst word Similar to the Knuth Morris Pratt Algorithm for the factor problem on words the algorithm simulates a nite automaton determined ...
متن کاملInclusion Problems in Trace Monoids
We suggest a number efficient pattern matching algorithms for dependence graphs of traces. A graph G = (V, E, λ) of partial order labeled by letters from alphabet Σ belongs to this class iff there exists a reflexive and symmetric relation D ⊂ Σ × Σ such that if v <G v′ and (λ(v).λ(v′)) ∈ D → (v, v′) ∈ E. We consider pattern matching problems related to problems of recognizing frequent patterns ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2003
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(03)00233-4